Adding Domain Dependent Knowledge into Answer Set Programs for Planning
نویسندگان
چکیده
We investigate the methodology of utilizing domain dependent knowledge in solving the planning problem in answer set programming. We provide a classification of domain dependent knowledge, and for each class, a coding scheme. In this way, domain dependent knowledge can be encoded into an existing program. Experiments are conducted to illustrate the effect of adding domain dependent knowledge for benchmark planning problems, which show that adding domain dependent knowledge in many cases substantially improves the search efficiency.
منابع مشابه
Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach
In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning wit...
متن کاملEfficiently Implementing GOLOG with Answer Set Programming
In this paper we investigate three different approaches to encoding domain-dependent control knowledge for Answer-Set Planning. Starting with a standard implementation of the action description language B, we add control knowledge expressed in the GOLOG logic programming language. A naive encoding, following the original definitions of Levesque et al., is shown to scale poorly. We examine two a...
متن کاملApplying Inductive Program Synthesis to Learning Domain-Dependent Control Knowledge | Transforming Plans into Programs
The goal of this paper is to demonstrate that inductive program synthesis can be applied to learning domain-dependent control knowledge from planning experience. We represent control rules as recursive program schemes (RPSs). An RPS represents the complete subgoal structure of a given problem domain with arbitrary complexity (e. g., rocket transportation problem with n objects). That is, if an ...
متن کاملGolog+HTN: Adding time and intervals to procedural and hierarchical control knowledge
In this paper we introduce a language for expressing procedural and HTN-based domain constraints. Our language starts with features from GOLOG and HTN and extends them so that we can deal with actions with duration by being able to specify time intervals between the start (or end) of an action (or a program) and the start of another action (or program). We then discuss a planner based on the an...
متن کاملPlanning and Scheduling in Hybrid Domains Using Answer Set Programming
In this paper we present an Action Language-Answer Set Programming based approach to solving planning and scheduling problems in hybrid domains domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into an A-Prolog program. In this way, we reduce the problem of finding solutions to planning and schedu...
متن کامل